Detecting Promising Areas by Evolutionary Clustering Search
نویسندگان
چکیده
A challenge in hybrid evolutionary algorithms is to define efficient strategies to cover all search space, applying local search only in actually promising search areas. This paper proposes a way of detecting promising search areas based on clustering. In this approach, an iterative clustering works simultaneously to an evolutionary algorithm accounting the activity (selections or updatings) in search areas and identifying which of them deserves a special interest. The search strategy becomes more aggressive in such detected areas by applying local search. A first application to unconstrained numerical optimization is developed, showing the competitiveness of the method. Keyword: Evolutionary algorithms; unconstrained numerical optimization.
منابع مشابه
A Preprocessing Phase for the Evolutionary Clustering Search
This paper approaches a recent hybrid evolutionary algorithm, called Evolutionary Clustering Search (ECS), that proposes a way of detecting promising areas combining an evolutionary algorithm and a iterative clustering. The search strategy become more aggressive in such detected areas by applying local search. In this paper, we developed a preprocessing phase for the ECS applying a locationallo...
متن کاملClustering Search Approach for the Traveling Tournament Problem
The Traveling Tournament Problem (TTP) is an optimization problem that represents some types of sports timetabling, where the objective is to minimize the total distance traveled by the teams. This work proposes the use of a hybrid heuristic to solve the mirrored TTP (mTTP), called Clustering Search (*CS), that consists in detecting supposed promising search areas based on clustering. The valid...
متن کاملImproved Automatic Clustering Using a Multi-Objective Evolutionary Algorithm With New Validity measure and application to Credit Scoring
In data mining, clustering is one of the important issues for separation and classification with groups like unsupervised data. In this paper, an attempt has been made to improve and optimize the application of clustering heuristic methods such as Genetic, PSO algorithm, Artificial bee colony algorithm, Harmony Search algorithm and Differential Evolution on the unlabeled data of an Iranian bank...
متن کاملClustering Search Heuristic for the Capacitated p -Median Problem
In this paper we present a hybrid heuristic for the capacitated pmedian problem (CPMP). This problem considers a set of n points, each of them with a known demand, the objective consists of finding p medians and assign each point to exactly one median such that the total distance of assigned points to their corresponding medians is minimized, and the a capacity limit on the medians may not be e...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کامل